منابع مشابه
Cost-Effective Clustering
Small Beowulf clusters can effectively serve as personal or group supercomputers. In such an environment, a cluster can be optimally designed for a specific problem (or a small set of codes). We discuss how theoretical analysis of the code and benchmarking on similar hardware lead to optimal systems.
متن کاملCost-Effective Clustering through Active Feature-value Acquisition
Many datasets include feature values that are missing but may be acquired at a cost. In this paper, we consider the clustering task for such datasets, and address the problem of acquiring missing feature values that improve clustering quality in a cost-effective manner. Since acquiring all missing information may be unnecessarily expensive, we propose a framework for iteratively selecting featu...
متن کاملLong Term Cost Effective Preventive Maintenance Scheduling
Preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. It consists of knowing which generating units should be shut down for regular safety inspection. In this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (CRI) is pr...
متن کاملEffective Clustering Algorithms for
Microarrays are made it possible to simultaneously monitor the expression profiles of thousands of genes under various experimental conditions. Identification of co-expressed genes and coherent patterns is the central goal in microarray or gene expression data analysis and is an important task in Bioinformatics research. In this paper, K-Means algorithm hybridised with Cluster Centre Initializa...
متن کاملMinimum Average Cost Clustering
A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2001
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(01)00312-5